A transference principle for Ramsey numbers of bounded degree graphs

We investigate Ramsey numbers of bounded degree graphs and provide an interpolation between known results on the Ramsey numbers of general bounded degree graphs and bounded degree graphs of small bandwidth. Our main theorem implies that there exists a constant c such that for every ∆, there exists β such that if G is an n-vertex graph with maximum degree at most ∆ having a homomorphism f into a graph H of maximum degree at most d where |f−1(v)| ≤ βn for all v ∈ V (H), then the Ramsey number of G is at most c log n. A construction of Graham, Rödl, and Ruciński shows that the statement above holds only if β ≤ (c′)∆ for some constant c′ < 1. We further study the parameter β using a densitytype embedding theorem for bipartite graphs of small bandwidth. This theorem may be of independent interest.